منابع مشابه
SRPT Scheduling for Web Servers
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every request at a web server, simply by changing the order in which we schedule the requests? In [4] we approach this question analytically via an M/G/1 queue. In [23] we approach the same question via implementation involving...
متن کاملImplementation of SRPT Scheduling in Web Servers
This paper proposes a method for improving the performance of Web servers servicing static HTTP requests. The idea is to give preference to those requests which are quick, or have small remaining processing requirements, in accordance with the SRPT (Shortest-Remaining-Processing-Time) scheduling policy. The implementation is at the kernel level and involves controlling the order in which socket...
متن کاملQuantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, scheduling policies, and service time distributio...
متن کاملApplications of SRPT Scheduling with Inaccurate Information
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield the smallest mean response time, and recently it was proven its performance gain over Processor Sharing (PS) usually does not come at the expense of large jobs. However, despite the many advantages of SRPT scheduling, it is not widely applied. One important reason for the sporadic application of S...
متن کاملMRRK-SRPT: a Scheduling Policy for Parallel Servers
For a system with a dispatcher and several identical servers in parallel, we propose a policy consisting of modified multi-layered round robin routing followed by shortest remaining processing time scheduling. We show that this policy has a heavy traffic limit that is identical to one in which there is a single queue (no routing) and optimal scheduling. Under light traffic, this policy is asymp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MaRBLe
سال: 2013
ISSN: 2468-0311
DOI: 10.26481/marble.2013.v1.135